On Approximate Geodesic-Distance Queries amid Deforming Point Clouds
نویسندگان
چکیده
We propose data structures for answering a geodesic-distance query between two query points in a two-dimensional or three-dimensional dynamic environment, in which obstacles are deforming continuously. Each obstacle in the environment is modeled as the convex hull of a continuously deforming point cloud. The key to our approach is to avoid maintaining the convex hull of each point cloud explicitly but still able to retain sufficient geometric information to estimate geodesic distances in the free space.
منابع مشابه
Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats
We consider the approximate nearest neighbor (ANN) problem where the input set consists of n k-flats in the Euclidean R, for any fixed parameters 0 ≤ k < d, and where, for each query point q, we want to return an input flat whose distance from q is at most (1 + ε) times the shortest such distance, where ε > 0 is another prespecified parameter. We present an algorithm that achieves this task wit...
متن کاملPoint Cloud Simplification and Processing for Path-Planning
Recently the area of motion planning research has been experiencing a significant resurgence of interest based on hybrid working environments that combine point and CAD models. Companies are able to work with point clouds and perform certain operations, such as path-planning, but they lack the support for fast shortest-distance computations for point clouds with more than tens of millions of po...
متن کاملCoresets of obstacles in approximating Euclidean shortest path amid convex obstacles
Given a set P of non-intersecting polygonal obstacles in R defined with n vertices, we compute a sketch Ω of P whose size is independent of n. We utilize Ω to devise an algorithm to compute a (1 + )-approximate Euclidean shortest path between two points given with the description of P. When P comprises of convex polygonal obstacles, we devise a (2 + )approximation algorithm to efficiently answe...
متن کاملGeodesic Fréchet Distance with Polygonal Obstacles
We present the first algorithm to compute the geodesic Fréchet distance between two polygonal curves in a plane with polygonal obstacles, where distances between points are measured as the length of a shortest path between them. Using shortest path structures that we call dynamic and static spotlights, we efficiently construct and propagate reachability information through the free space diagra...
متن کاملApproximate Visibility for Illumination Computations using Point Clouds
In this paper, we present a simple technique to evaluate the visibility between pairs of points in a scene. In most current rendering algorithms, visibility queries are evaluated exactly. Our approach approximates the visibility value between two points using a point cloud representation of the surfaces in the scene. The computed value is a function of the distance and orientation of points in ...
متن کامل